Positive entries of stable matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Positive entries of stable matrices

The question of how many elements of a real positive stable matrix must be positive is investigated. It is shown that any real stable matrix of order greater than 1 has at least two positive entries. Furthermore, for every stable spectrum of cardinality greater than 1 there exists a real matrix with that spectrum with exactly two positive elements, where all other elements of the matrix can be ...

متن کامل

Entries of Indefinite Nevanlinna Matrices

In the early 1950’s, M. G. Krein characterized the entire functions that are an entry of some Nevanlinna matrix, and the pairs of entire functions that are a row of some Nevanlinna matrix. In connection with Pontryagin space versions of Krein’s theory of entire operators and de Branges’ theory of Hilbert spaces of entire functions, an indefinite analog of the Nevanlinna matrices plays a role. I...

متن کامل

Concentration of the Spectral Measure for Large Random Matrices with Stable Entries

We derive concentration inequalities for functions of the empirical measure of large random matrices with infinitely divisible entries and, in particular, stable ones. We also give concentration results for some other functionals of these random matrices, such as the largest eigenvalue or the largest singular value. AMS 2000 Subject Classification: 60E07, 60F10, 15A42, 15A52

متن کامل

Small entries of neutrino mass matrices

We consider phenomenologically allowed structures of the neutrino mass matrix in the case of three light neutrino species. Constraints from the solar, atmospheric and reactor neutrino experiments as well as those from the neutrinoless double beta decay are taken into account. Both hierarchical and quasi-degenerate neutrino mass cases are studied. Assuming maximal νμ − ντ mixing we derive simple...

متن کامل

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Linear Algebra

سال: 2005

ISSN: 1081-3810

DOI: 10.13001/1081-3810.1142